Price of fairness in two-agent single-machine scheduling problems
نویسندگان
چکیده
منابع مشابه
Single-Machine two-agent scheduling problems with unconstrained strategies
We address a class of deterministic scheduling problems in which two agents compete for the usage of a single machine. The agents have their own objective functions and submit in each round an arbitrary, unprocessed task from their buffer for possible selection. In each round the shorter of the two submitted tasks is chosen and processed on the machine. We consider the problems under two distin...
متن کاملSingle machine scheduling problems
In this paper, single machine scheduling problems with sequence dependent setup times are considered. The objective is to minimize the total weighted tardiness. The single machine total weighted tardiness (SMTWT) scheduling problems with sequence dependent setup times were proved to be strongly NP-hard. A recently developed meta-heuristic algorithm called as crow search algorithm is proposed to...
متن کاملMulti-agent single machine scheduling
We consider the scheduling problems arising when several agents, each owning a set of nonpreemptive jobs, compete to perform their respective jobs on one shared processing resource. Each agent wants to minimize a certain cost function, which depends on the completion times of its jobs only. The cost functions we consider in this paper are maximum of regular functions (associated with each job),...
متن کاملNet Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems
While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...
متن کاملNet Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems
While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2019
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2018.12.048